Invoice Factoring Registration Based on a Public Blockchain

نویسندگان

چکیده

Invoice factoring is a very useful tool for developing businesses that face liquidity problems. The main property system needs to fulfill prevent an invoice from being factored twice. In order double factoring, many ecosystems use one or several centralized entities register agreements. However, this puts lot of power in the hands these and makes it difficult users dispute situations which data unavailable, wrongly recorded manipulated by negligence on purpose. article, we propose architecture registration based public blockchain. To solve aforementioned drawbacks, replace trusted third parties with smart contract. Using contract, record digital evidence terms conditions agreements explicit detail, allowing auditability resolution. Relevant information highly available blockchain while its privacy protected. optimal, since only transaction key-value storage per factoring.

منابع مشابه

A Fast Semantically Secure Public Key Cryptosystem Based on Factoring

The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent attack. In this paper we propose a cryptosystem over singular cubic curve using the idea of Koyama and Kouichi et al. Our proposed cryptosystem is approximately two times faster than the cryptosystem given by Kouichi et...

متن کامل

A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring

Elliptic curves over the ring Z / n Z where R is the product of two large primes have first been proposed for public key cryptosystems in [4]. The security of this system is based on the integer factorization problem, but it is unknown whether breaking the system is equivalent to factoring. In this paper, we present a variant of this cryptosystem for which breaking the system is equivalent to f...

متن کامل

Based on RSA and Factoring

Abstract—Non-malleability is an important property in commitment schemes. It can resist to the person-in-the-middle (PIM) attacks within the interaction. In this paper, we focus on the non-malleability in ID-based trapdoor commitments. We first give two constructions of (full) ID-based trapdoor commitment schemes based on RSA and Factoring assumptions respectively and then extend them to non-m...

متن کامل

Threshold Cryptosystems Based on Factoring

We consider threshold cryptosystems over a composite modulus N where the factors of N are shared among the participants as the secret key. This is a new paradigm for threshold cryptosystems based on a composite modulus, differing from the typical treatment of RSA-based systems where a “decryption exponent” is shared among the participants. Our approach yields solutions to some open problems in ...

متن کامل

An ID-Based Public Key Cryptosystem based on Integer Factoring and Double Discrete Logarithm Problem

In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify him self before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communicatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3056626